Independent dominating sets in triangle-free graphs
نویسندگان
چکیده
منابع مشابه
Independent dominating sets in triangle-free graphs
The independent domination number of a graph is the smallest cardinality of an independent set that dominates the graph. In this paper we consider the independent domination number of triangle-free graphs. We improve several of the known bounds as a function of the order and minimum degree, thereby answering conjectures of Haviland.
متن کاملCounting independent sets in triangle-free graphs
Ajtai, Komlós, and Szemerédi proved that for sufficiently large t every trianglefree graph with n vertices and average degree t has an independent set of size at least n 100t log t. We extend this by proving that the number of independent sets in such a graph is at least 2 1 2400 n t log . This result is sharp for infinitely many t, n apart from the constant. An easy consequence of our result i...
متن کاملDominating cycles in triangle-free graphs
A cycle C in a graph G is said to be dominating if E(G−C) = ∅. Enomoto et al. showed that if G is a 2-connected triangle-free graph with α(G) ≤ 2κ(G) − 2, then every longest cycle is dominating. But it is unknown whether the condition on the independence number is sharp. In this paper, we show that if G is a 2-connected triangle-free graph with α(G) ≤ 2κ(G) − 1, then G has a longest cycle which...
متن کاملIndependent sets in triangle-free cubic planar graphs
We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 38n. This was suggested and later conjectured by Albertson, Bollobás, and Tucker.
متن کاملLarge Independent Sets in Triangle-Free Planar Graphs
Every triangle-free planar graph on n vertices has an independent set of size at least (n+ 1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free planar graph G on n vertices and an integer k ≥ 0, decides whether G has an independent set of size at least (n+ k)/3, in time 2 √ n. Thus, the problem is fixed-parameter tractable when parameterized by k. Furthermore, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2010
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-010-9336-4